package com.cjm.algorithm.dp;

public class Ti746 {
    public static void main(String[] args) {
        Ti746 ti746 = new Ti746();
        int i = ti746.minCostClimbingStairs(new int[]{1, 100, 1, 1, 1, 100, 1, 1, 100, 1});
        int j = ti746.minCostClimbingStairs(new int[]{10, 15, 20});
        System.err.println("ob");
    }
    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length + 1];
        dp[0] = cost[0];
        dp[1] = cost[1];
        for (int i = 2; i < cost.length; i++) {
            dp[i] = Math.min(dp[i - 1], dp[i - 2]) + cost[i];
        }
        return Math.min(dp[dp.length-1], dp[cost.length - 2]);
    }
}
